On the Perimeters of Simple Polygons Contained in a Plane Convex Body
نویسنده
چکیده
A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach [2, Problem 3, p. 437] asked the following question: For n ≥ 5 odd, what is the maximum perimeter of a simple n-gon contained in a Euclidean unit disk? In 2009, Audet, Hansen and Messine [1] answered this question, and showed that the supremum is the perimeter of an isosceles triangle inscribed in the disk, with an edge of multiplicity n − 2. In [3], Lángi generalized their result for polygons contained in a hyperbolic disk. In this note we find the supremum of the perimeters of simple n-gons contained in an arbitrary convex body in the Euclidean or in the hyperbolic plane.
منابع مشابه
Finding Optimal Bipartitions of Points and Polygons
We give eecient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. In particular, we give an O(n 2) algorithm for partitioning a set of n points into two subsets in order to minimize the sum of the perimeters of the convex hulls. We also examine the problems of minimizing the maximum of the perimeters, or the sum/maximum of the areas, for t...
متن کاملOn Perimeters of Sections of Convex Polytopes
In his book “Geometric Tomography” Richard Gardner asks the following question. Let P and Q be origin-symmetric convex bodies in R whose sections by any plane through the origin have equal perimeters. Is it true that P = Q? We show that the answer is “Yes” in the class of origin-symmetric convex polytopes. The problem is treated in the general case of R.
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملPlanar line processes for void and density statistics in thin stochastic fibre networks
Using results for the distribution of perimeters of random polygons arising from random lines in a plane, we obtain new analytic approximations to the distributions of areas and local line densities for random polygons and compute various limiting properties of random polygons. Using simulation, we show that the lengths of adjacent sides of polygons generated by random line processes in the pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012